Constrained optimization via unconstrained minimization
نویسندگان
چکیده
منابع مشابه
Nonlinear complementarity as unconstrained and constrained minimization
The nonlinear complementarity problem is cast as an unconstrained minimization problem that is obtained from an augmented Lagrangian formulation. The dimensionality of the unconstrained problem is the same as that of the original problem, and the penalty parameter need only be greater than one. Another feature of the unconstrained problem is that it has global minima of zero at precisely all th...
متن کاملConstrained via minimization
We show that the general two layer constrained via minimization problem and the three layer constrained via minimization problem for HVH topologies are NP-hard. A backtracking and a heuristic algorithm for the three layer HVH constrained via minimization problem are proposed. The backtracking algorithm can also be used for three layer non HVH problems. Experimental results indicate that our heu...
متن کاملInterval Analysis: Unconstrained and Constrained Optimization
INTERVAL ANALYSIS: UNCON-STRAINED AND CONSTRAINED OPTIMIZATION Introduction. Interval algorithms for constrained and un-constrained optimization are based on adaptive, exhaustive search of the domain. Their overall structure is virtually identical to Lipschitz optimization as in [4], since interval evaluations of an objective function φ over an interval vector x correspond to estimation of the ...
متن کاملA Proximal Minimization Algorithm for Constrained Optimization
The proximal minimization algorithm (PMA) is an iterative method for minimizing a convex function f(x) over D, the closure of the essential domain of a second convex function h. The PMA is an interior-point algorithm, in the sense that each iterate lies within the interior of D. For each k, the next iterate, x, minimizes the function f(x) +Dh(x, x ), where Dh(x, z) = h(x)− h(z)− 〈∇h(z), x− z〉 i...
متن کاملLagrangian support vector regression via unconstrained convex minimization
In this paper, a simple reformulation of the Lagrangian dual of the 2-norm support vector regression (SVR) is proposed as an unconstrained minimization problem. This formulation has the advantage that its objective function is strongly convex and further having only m variables, where m is the number of input data points. The proposed unconstrained Lagrangian SVR (ULSVR) is solvable by computin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Banach Center Publications
سال: 1984
ISSN: 0137-6934,1730-6299
DOI: 10.4064/-13-1-707-718